#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 205;

int n, m;
int a[N];
int cnt[10];
void solve() {
  cin >> n >> m;
  rep(i, 0, n - 1) cin >> a[i];
  rep(i, 1, 9) cnt[i] = 0;
  rep(i, 0, n - 1) cnt[a[i]]++;
  int pos = 0;
  int t = 0;
  per(i, 9, 1) {
    while (cnt[i]) {
      while (a[pos] < i) pos = (pos + 1) % n;
      a[pos] = 0;
      cnt[i]--;
      t++;
      if (pos == m) cout << t << endl;
    }
  }
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}